Queue Prediction: an efficient scheduler for fast ATM cell transmission

نویسنده

  • Peter Fenwick
چکیده

A central problem in ATM switches is the selection of cells to be transmitted on an output line. In general each line has a number of queues, all of which must be handled in a timely manner to provide throughput for each circuit and guarantee its required quality of service. While the problem of the queuing disciplines has been addressed, many of the solutions are computationally complex and appear to be difficult, if not impossible within the time constraints of fast ATM transmission (622 Mbps or higher). This paper presents a solution to this problem. By scheduling in advance the transmissions from queues it allows all output queues for a line to be serviced with minimal overhead and with timings appropriate to each specific queue. Desirable queuing strategies follow automatically as a consequence of the scheduling mechanism. The mechanism appears to be capable of handling many queues (hundreds or thousands) for each output line. A mechanism is proposed for the efficient handling of Variable Bit Rate, time critical traffic. K e y w o r d s ATM cell transmission, queue management, Queue Prediction scheduling

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High-Performance OC-12/OC-48 Queue Design Prototype for Input-buffered ATM Switches

This paper presents the design and prototype of an intelligent, 3-Dimensional-Queue (3DQ) for highperformance, scalable, input bu ered ATM switches. 3DQ uses pointers and linked lists to organize ATM cells into multiple virtual queues according to priority, destination, and virtual connection. It enforces per virtual connection Quality-of-Service (QoS) and eliminates Head-Of-Line (HOL) blocking...

متن کامل

A High - performance OC - 12 / OC - 48 Queue Design Prototype forInput - bu ered ATM

Input-bu ered ATM Switches Haoran Duan; J. W. Lockwood, S. M. Kang, and J. D. Will University of Illinois at Urbana{Champaign NSF ERC for Compound Semiconductor Microelectronics Department of Electrical and Computer Engineering and Beckman Institute for Advanced Science and Technology 405 N. Mathews Ave., Urbana, IL 61801, U.S.A. (217) 244-1565 (Voice), (217) 244-8371 (FAX) email: [email protected]...

متن کامل

A High performance OC OC Queue Design Prototype for Input bu ered ATM Switches

This paper presents the design and prototype of an intelligent Dimensional Queue DQ for high performance scalable input bu ered ATM switches DQ uses pointers and linked lists to organize ATM cells into multiple virtual queues according to prior ity destination and virtual connection It enforces per virtual connection Quality of Service QoS and elim inates Head Of Line HOL blocking Using Field P...

متن کامل

A Cell Burst Scheduling for ATM Networking Part I: Theory

Fair queueing is a useful queueing discipline for packet switching systems. It was developed in last decade and was aimed at the general packet switching systems with varying packet length. However, it is not suitable for use in the ATM networking, because the ATM cell length is very small and fixed, and so the scheduling scheme on a per cell basis isn’t practical. Here we introduce the burst a...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007